Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Adicionador")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 553

  • Page / 23
Export

Selection :

  • and

Pipelined carry look-ahead adderCRAWLEY, D. G; AMARATUNGA, G. A. J.Electronics Letters. 1986, Vol 22, Num 12, pp 661-662, issn 0013-5194Article

A reduced-area scheme for carry-select addersTYAGI, A.IEEE transactions on computers. 1993, Vol 42, Num 10, pp 1163-1170, issn 0018-9340Article

Parity predictor for shifting-output addersVASSILIADIS, S; PUTRINO, M; SCHWARZ, E. M et al.Electronics Letters. 1989, Vol 25, Num 6, pp 422-424, issn 0013-5194, 3 p.Article

Two's complement division without using the set of full precision comparisonsBASHAGHA, A. E; IBRAHIM, M. K.IEE proceedings. Computers and digital techniques. 1998, Vol 145, Num 1, pp 19-26, issn 1350-2387Article

An optoelectronic adderMACDONALD, R. I.Proceedings of the IEEE. 1986, Vol 74, Num 11, pp 1593-1595, issn 0018-9219Article

A way to built efficient carry skip addersHOCHET, B; MULLER, J. M.Rapport de recherche - Informatique et mathématiques appliquées de Grenoble, ISSN: 0750-7380 ; 583. 1986, 14 p.Report

An adder design optimized for DCS logicWEINBERGER, A.IBM journal of research and development. 1991, Vol 35, Num 3, pp 352-356, issn 0018-8646Article

A high-speed multiplier using a redundant binary adder treeHARATA, Y; NAKAMURA, Y; NAGASE, H et al.IEEE journal of solid-state circuits. 1987, Vol 22, Num 1, pp 28-34, issn 0018-9200Article

Multi-beam TWT with active power combiningLI GAN; MO, Y.-L; LIU, S.-G et al.International journal of electronics. 1998, Vol 84, Num 6, pp 647-657, issn 0020-7217Article

The flagged prefix adder for dual additionsBURGESS, N.SPIE proceedings series. 1998, pp 567-575, isbn 0-8194-2916-3Conference Paper

Efficient testing of optimal time addersBECKER, B.IEEE transactions on computers. 1988, Vol 37, Num 9, pp 1113-1121, issn 0018-9340Article

A pipelined binary coded decimal adder using the residue number systemADEGBENRO, O; SALAWU, R. I.International journal of electronics. 1987, Vol 62, Num 2, pp 209-217, issn 0020-7217Article

An upper bound for codes for the noisy two-access binary adder channelVAN TILBORG, H. C. A.IEEE transactions on information theory. 1986, Vol 32, Num 3, pp 436-440, issn 0018-9448Article

Addition de puissance de deux diodes Gunn en technologie quasi-optique en bande Ka = Ka band quasi-optical technology power adder for two Gunn diodesCAM, H; DESCHAMPS, B; BOURREAU, D et al.Journées nationales microondes. 1997, pp 300-301, 2VolConference Paper

Multi-operand modulo addition using carry save addersKOC, C. K; HUNG, C. Y.Electronics Letters. 1990, Vol 26, Num 6, pp 361-363, issn 0013-5194, 3 p.Article

A diagonal address generator for a Josephson memory circuitSUZUKI, H; HASUO, S.IEEE journal of solid-state circuits. 1987, Vol 22, Num 1, pp 92-97, issn 0018-9200Article

Direct two's-complement algorithm for XY±ZVASSILIADIS, S; PUTRINO, M; SWARTZ, E et al.Electronics Letters. 1987, Vol 23, Num 10, pp 538-540, issn 0013-5194Article

Logical effort of higher valency addersHARRIS, David.Asilomar Conference on Signals, Systems & Computers. 2004, isbn 0-7803-8622-1, 2Vol, vol 2, 1358-1362Conference Paper

Decimal adder based on optoelectronic memory devicesSEMENYUK, Michael.SPIE proceedings series. 2001, pp 410-416, isbn 0-8194-4136-8Conference Paper

RNS-based logarithmic adderPREETHY, A. P; RADHAKRISHNAN, D.IEE proceedings. Computers and digital techniques. 2000, Vol 147, Num 4, pp 283-287, issn 1350-2387Article

An approach to ROM-adder multiplication based on tables of squaresRUSHDI, A. M.International journal of electronics. 1992, Vol 73, Num 2, pp 241-246, issn 0020-7217Article

A design for an efficient NOR-gate only, binary-ripple adder with carry-completion-detection logicSALOMON, D.Computer journal (Print). 1987, Vol 30, Num 3, pp 283-285, issn 0010-4620Article

A minimum test set for multiple fault detection in ripple carry addersWU-TUNG CHENG; PATEL, J. H.IEEE transactions on computers. 1987, Vol 36, Num 7, pp 891-895, issn 0018-9340Article

Method to reduce the sign bit extension in a multiplier that uses the modified booth algorithmROORDA, M.Electronics Letters. 1986, Vol 22, Num 20, pp 1061-1062, issn 0013-5194Article

Associativity, auto-reversibility and question-answering on Q'tron neural networksYUE, Tai-Wen; CHEN, Mei-Ching.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28226-2, 2Vol, part I, 1023-1034Conference Paper

  • Page / 23